Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Traitement liste")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 335

  • Page / 14
Export

Selection :

  • and

Performance analysis of on-the-fly garbage collectionHICKEY, T; COHEN, J.Communications of the ACM. 1984, Vol 27, Num 11, pp 1143-1154, issn 0001-0782Article

Direct-chaining with coalescing listsKNOTT, G. D.Journal of algorithms (Print). 1984, Vol 5, Num 1, pp 7-21, issn 0196-6774Article

Présentation du langage Icon = Icon language introductionLECARME, O.TSI. Technique et science informatiques. 1988, Vol 7, Num 3, pp 295-307, issn 0752-4072Article

LISP machine «ALPHA»HAYASHI, H; HATTORI, A; AKIMOTO, H et al.Fujitsu scientific and technical journal. 1984, Vol 20, Num 2, pp 219-234, issn 0016-2523Article

New applications of failure functionsHIRSCHBERG, D. S; LARMORE, L. L.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 3, pp 616-625, issn 0004-5411Article

Erreur de quelques algorithmes approchés d'ordonnancement par listeSPESIVTSEV, A. V.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 6, pp 22-28, issn 0002-3388Article

Hardware implementation of data flow machineYOSHIDA, M; NARUSE, T; NAKAMURA, O et al.Review of the electrical communication laboratories. 1984, Vol 32, Num 5, pp 803-812, issn 0029-067XArticle

Reference count garbage collectionCHRISTOPHER, T. W.Software, practice & experience. 1984, Vol 14, Num 6, pp 503-507, issn 0038-0644Article

Parallel priority queue and list contraction : The BSP approachGERBESSIOTIS, A. V; SINIOLAKIS, C. J; TISKIN, A et al.Lecture notes in computer science. 1997, pp 409-416, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Splitmerge ― a fast stable merging algorithmCARLSSON, S.Information processing letters. 1986, Vol 22, Num 4, pp 189-192, issn 0020-0190Article

Approximate parallel scheduling. I: The basic technique with applications to optimal parallel list ranking in logarithmic timeCOLE, R; VISHKIN, U.SIAM journal on computing (Print). 1988, Vol 17, Num 1, pp 128-142, issn 0097-5397Article

A unified software pipeline construction scheme for modulo scheduled loopsDUPONT DE DINECHIN, B.Lecture notes in computer science. 1998, pp 382-393, issn 0302-9743, isbn 3-540-64472-5Conference Paper

A novel representation of lists and its application to the function reverseHUGHES, R. J. M.Information processing letters. 1986, Vol 22, Num 3, pp 141-144, issn 0020-0190Article

The analysis of simple list structuresFLAJOLET, P; PUECH, C; VUILLEMIN, J et al.Information sciences. 1986, Vol 38, Num 2, pp 121-146, issn 0020-0255Article

Le désespoir du concaténateur = The «concatenator» despairMONIN, J. F.1985, 2 p.Report

Valid, a high-level functional programming language for data flow machinesAMAMIYA, M; HASEGAWA, R; ONO, S et al.Review of the electrical communication laboratories. 1984, Vol 32, Num 5, pp 793-802, issn 0029-067XArticle

A new family of randomized algorithms for list accessingGAREFALAKIS, T.Lecture notes in computer science. 1997, pp 200-216, issn 0302-9743, isbn 3-540-63397-9Conference Paper

Parallel comparison merging of many-ordered listsAZAR, Y.Theoretical computer science. 1991, Vol 83, Num 2, pp 275-285, issn 0304-3975, 11 p.Article

Parallel algorithms for computing linked list prefixYIJIE HAN.Journal of parallel and distributed computing (Print). 1989, Vol 6, Num 3, pp 537-557, issn 0743-7315Article

List processing primitives for parallel computation = Primitives de traitement de liste pour le calcul parallèleAXFORD, T; JOY, M.Computer languages. 1993, Vol 19, Num 1, pp 1-17, issn 0096-0551Article

An optimal absorbing list organization strategy with constant memory requirementsOOMMEN, B. J; NG, D. T. H.Theoretical computer science. 1993, Vol 119, Num 2, pp 355-361, issn 0304-3975Article

Combining lists with non-stably infinite theoriesFONTAINE, Pascal; RANISE, Silvio; ZARBA, Calogero G et al.Lecture notes in computer science. 2005, pp 51-66, issn 0302-9743, isbn 3-540-25236-3, 16 p.Conference Paper

Programming language constructs for highly parallel operations on listsSOLWORTH, J. A.Journal of supercomputing. 1988, Vol 2, Num 3, pp 331-347, issn 0920-8542Article

Codage en liste d'arbres quaternaires = List coding of quadtreesRONSE, C.TSI. Technique et science informatiques. 1988, Vol 7, Num 2, pp 235-245, issn 0752-4072Article

Padded lists revisitedHOFRI, M; KONHEIM, A. G.SIAM journal on computing (Print). 1987, Vol 16, Num 6, pp 1073-1114, issn 0097-5397Article

  • Page / 14